A review on the electric vehicle routing problems: Variants and algorithms

نویسندگان

چکیده

Abstract Over the past decade, electric vehicles (EVs) have been considered in a growing number of models and methods for vehicle routing problems (VRPs). This study presents comprehensive survey EV their many variants. We only consider which each may visit multiple vertices be recharged during trip. The related literature can roughly divided into nine classes: Electric traveling salesman problem, green VRP, mixed location hybrid dial-a-ride two-echelon pickup delivery problem. For these classes, we focus on reviewing settings problem variants algorithms used to obtain solutions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows

Effective route planning for battery electric commercial vehicle (ECV) fleets has to take into account their limited autonomy and the possibility of visiting recharging stations during the course of a route. In this paper, we consider four variants of the electric vehicle-routing problem with time windows: (i) at most a single recharge per route is allowed, and batteries are fully recharged on ...

متن کامل

A Review on the Evolution of Vehicle Routing Problems

This paper provides an indepth review on evolution of vehicle routing problems from savings matrix to time dependent vehicle routing problems. It is suggested that as to how VRPBH framework of Goetschalckx and Jacobs-Blecha has offered better solution to routing problems that Clarke-Wright Savings matrix and with the introduction of time -window concept the result of heuristic has improved dras...

متن کامل

A review of dynamic vehicle routing problems

Journal : European Journal of Operational Research State : Accepted manuscript doi:10.1016/j.ejor.2012.08.015 Abstract : A number of technological advances have led to a renewed interest on dynamic vehicle routing problems. This survey classiVes routing problems from the perspective of information quality and evolution. After presenting a general description of dynamic routing, we introduce the...

متن کامل

Learning Hybrid Algorithms for Vehicle Routing Problems

This paper presents a generic technique for improving hybrid algorithms through the discovery of and tuning of meta-heuristics. The idea is to represent a family of “push/pull” heuristics that are based upon inserting and removing tasks in a current solution, with an algebra. We then let a learning algorithm search for the best possible algebraic term, which represents a hybrid algorithm for a ...

متن کامل

Parallel algorithms for vehicle routing problems

In a complete directed weighted graph there are jobs located at nodes of the graph. Job i has an associated processing time or handling time hi, and the job must start within a prespecified time window [ri; di]. A vehicle can move on the arcs of the graph, at unit speed, and that has to execute the jobs within their respective time windows. We consider three different problems on the CREW PRAM....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Frontiers of Engineering Management

سال: 2021

ISSN: ['2095-7513', '2096-0255']

DOI: https://doi.org/10.1007/s42524-021-0157-1